Numerical implementation of the QuEST function
نویسندگان
چکیده
This paper deals with certain estimation problems involving the covariance matrix in large dimensions. Due to the breakdown of finite-dimensional asymptotic theory when the dimension is not negligible with respect to the sample size, it is necessary to resort to an alternative framework known as large-dimensional asymptotics. Recently, Ledoit and Wolf (2015) have proposed an estimator of the eigenvalues of the population covariance matrix that is consistent according to a mean-square criterion under large-dimensional asymptotics. It requires numerical inversion of a multivariate nonrandom function which they call the QuEST function. The present paper explains how to numerically implement the QuEST function in practice through a series of six successive steps. It also provides an algorithm to compute the Jacobian analytically, which is necessary for numerical inversion by a nonlinear optimizer. Monte Carlo simulations document the effectiveness of the code.
منابع مشابه
An Improvement to QUEST JAS 1290 Rev 5 o III Newton - Raphson sequence for λ
A numerical improvement is made to the QUEST algorithm. The signi cance of the expanded and partially-factored forms of the overlap characteristic polynomial for the computation of the maximum overlap (gain function) is examined in detail. The implementation of the partially-factored form of the QUEST characteristic polynomial greatly improves the numerical properties of that polynomial. Analys...
متن کاملA Multi Objective Geometric Programming Model for Optimal Production and Marketing Planning
This paper presents a multi objective geometric programming model which determines the product`s selling price in two markets. We assume demand is a function of price and marketing expenditure in two markets. The cost of production is also assumed to be a function of demands in both markets. Our model is a posynomial function which is solved using Geometric Programming (GP). In our GP implement...
متن کاملUnscented Auxiliary Particle Filter Implementation of the Cardinalized Probability Hypothesis Density Filters
The probability hypothesis density (PHD) filter suffers from lack of precise estimation of the expected number of targets. The Cardinalized PHD (CPHD) recursion, as a generalization of the PHD recursion, remedies this flaw and simultaneously propagates the intensity function and the posterior cardinality distribution. While there are a few new approaches to enhance the Sequential Monte Carlo (S...
متن کاملHierarchical basis for stabilized nite elementmethods for compressible owsChristian
The quest for more accurate numerical simulations of the Navier Stokes equations has motivated the study of high-order piecewise-polynomial basis functions, also known as k-version nite element methods, as a means to attain this accuracy in the most cost eeective manner. Stabilized nite element methods (e.g. SUPG) have been proven to attain optimal rates of convergence for any polynomial order ...
متن کاملA Trust Region Algorithm for Solving Nonlinear Equations (RESEARCH NOTE)
This paper presents a practical and efficient method to solve large-scale nonlinear equations. The global convergence of this new trust region algorithm is verified. The algorithm is then used to solve the nonlinear equations arising in an Expanded Lagrangian Function (ELF). Numerical results for the implementation of some large-scale problems indicate that the algorithm is efficient for these ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computational Statistics & Data Analysis
دوره 115 شماره
صفحات -
تاریخ انتشار 2017